An adaptive guidance meta-heuristic for the vehicle routing problem with splits and clustered backhauls
نویسندگان
چکیده
منابع مشابه
An adaptive guidance meta-heuristic for the vehicle routing problem with splits and clustered backhauls
● If one considers the instances with Q= 2 with respect to those with Q= 1, the routing cost decreases by 44.30% in the case of 10 customers, up to 47.65% in the case of 50 customers. ● If one compares the instances with Q= 4 to those with Q= 2, the routing cost decreases by 38.72% in the case of 10 customers, up to 46.06% in the case of 40 customers. ● If one considers the instances with Q= 6 ...
متن کاملAn advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows
This paper presents an advanced hybrid meta-heuristic algorithm (HMA) to solve the vehicle routing problem with backhauls and time windows (VRPBTW). The VRPBTW is an extension of the vehicle routing problem with time windows (VRPTW) and the vehicle routing problem with backhauls (VRPB) that includes capacity, backhaul and time window constraints. In this problem, the customers are divided into ...
متن کاملVehicle Routing Problem: Meta-heuristic Approaches
The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...
متن کاملA Threshold Accepting Meta-heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
This paper presents a meta-heuristic, which is based on the Threshold Accepting combined with modified Nearest Neighbor and Exchange procedures, to solve the Vehicle Routing Problem with Backhauls and Time Windows (VRPBTW). The VRPBTW assumes that trucks initially start from the depot, deliver goods to the linehaul customers, successively pickup goods from the backhaul consumers, and finally re...
متن کاملMetaheuristics for the Vehicle Routing Problem with Clustered Backhauls and 3D Loading Constraints
In this paper, we extend the vehicle routing problem with clustered backhauls (VRPCB) to an integrated routing and three-dimensional loading problem, called VRPCB with 3D loading constraints (3L-VRPCB). In the VRPCB each customer is either a linehaul or a backhaul customer and in each route all linehaul customers must be visited before any backhaul customer. In the 3L-VRPCB, each customer deman...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2015
ISSN: 0160-5682,1476-9360
DOI: 10.1057/jors.2014.123